Production Scheduling of Batch Processes Based on Adaptive DE Algorithm
نویسندگان
چکیده
Production scheduling problems and traditional differential evolution(DE) are analyzed in this paper. Taking the minimum of total completion time as the objective function of production scheduling, a production scheduling model is established for batch processes in process industry.Considering that the performance of the traditional DE algorithm is sensitive to the parameter settings,an adaptive control evolution strategy is used to control the parameter scale factor F and crossover probability CR to solve the problem of parameter settings. Taking a practical production problem as a scheduling example,the established model and adaptive DE algorithm are applied to implement the production scheduling simulation. The simulation results show that compared with the ant colony system(ACS) algorithm,the adaptive DE algorithm is effective and feasible.
منابع مشابه
Coordinating Order Acceptance and Batch Delivery for an Integrated Supply Chain Scheduling
This paper develops Order Acceptance for an Integrated Production-Distribution Problem in which Batch Delivery is implemented. The aim of this problem is to coordinate: (1) rejecting some of the orders (2) production scheduling of the accepted orders and (3) batch delivery to maximize Total Net Profit. A Mixed Integer Programming is proposed for the problem. In addition, a hybrid meta-heuristic...
متن کاملA modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملA Reliability based Modelling and Optimization of an Integrated Production and Preventive Maintenance Activities in Flowshop Scheduling Problem
Traditional scheduling problems with the batch processing machines (BPM) assume that machines are continuously available, and no time is needed for their preventive maintenance (PM). In this paper, we study a realistic variant of flowshop scheduling which integrates flow shop batch processing machines (FBPM) and preventive maintenance for minimizing the makespan. In order to tackle the given pr...
متن کاملEfficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine
Just-in-time scheduling problem on a single batch processing machine is investigated in this research. Batch processing machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of just-in-time strategy, minimization of total earliness and tardiness penalties is considered as the criterion. It is an acceptable criterion for b...
متن کاملCross-layer Packet-dependant OFDM Scheduling Based on Proportional Fairness
This paper assumes each user has more than one queue, derives a new packet-dependant proportional fairness power allocation pattern based on the sum of weight capacity and the packet’s priority in users’ queues, and proposes 4 new cross-layer packet-dependant OFDM scheduling schemes based on proportional fairness for heterogeneous classes of traffic. Scenario 1, scenario 2 and scenario 3 lead r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JCP
دوره 8 شماره
صفحات -
تاریخ انتشار 2013